Term rewriting theory for the recursive functions
نویسندگان
چکیده
The termination of rewrite systems for parameter recursion, simple nested recursion and unnested multiple recursion is shown by using monotone interpretations both on the ordinals below the first primitive recursively closed ordinal and on the natural numbers. We show that the resulting derivation lengths are primitive recursive. As a corollary we obtain transparent and illuminating proofs of the facts that the schemata of parameter recursion, simple nested recursion and unnested multiple recursion lead from primitive recursive functions to primitive recursive functions.
منابع مشابه
Conversion to tail recursion in term rewriting
Tail recursive functions are a special kind of recursive functions where the last action in their body is the recursive call. Tail recursion is important for a number of reasons (e.g., they are usually more efficient). In this article, we introduce an automatic transformation of first-order functions into tail recursive form. Functions are defined using a (first-order) term rewrite system. We p...
متن کاملOn the Equivalence of Persistent Term Rewriting Systems and Recursive Program Schemes
We introduce Persistent Term Rewriting Systems (PTRSs) by restricting redex-creation during reductions in Orthogonal Term Rewriting Systems (OTRSs 6, 10]). In particular, Recursive (Applicative) Program Schemes (RPSs 4]), considered as TRSs, are persistent. Two PTRSs R and R 0 are syntactically equivalent when any term t has an R-normal form ii it has an R 0-normal form and they coincide. We pr...
متن کاملDerivation lengths in term rewriting from interpretations in the naturals
Monotone interpretations in the natural numbers provide a useful technique for proving termination of term rewriting systems. Termination proofs of this shape imply upper bounds on derivation lengths expressed in bounds on the interpretations. For a hierarchy of classes of interpretations we describe these upper bounds, among which the doubly exponential upper bound for polynomial interpretatio...
متن کاملPrimitive Rewriting
Undecidability results in rewriting have usually been proved by reduction from undecidable problems of Turing machines or, more recently, from Post’s Correspondence Problem. Another natural candidate for proofs regarding term rewriting is Recursion Theory, a direction we promote in this contribution. We present some undecidability results for “primitive” term rewriting systems, which encode pri...
متن کاملData-Driven Learning of Functions over Algebraic Datatypes from Input/Output-Examples
We describe a technique for inducing recursive functional programs over algebraic datatypes from few non-recursive and only positive ground example-equations. Induction is data-driven and based on structural regularities between example terms. In our approach, functional programs are represented as constructor term rewriting systems containing recursive rewrite rules. In addition to the example...
متن کامل